An Experimental Study on the Ply Number of Straight-Line Drawings

نویسندگان

  • Felice De Luca
  • Emilio Di Giacomo
  • Walter Didimo
  • Stephen G. Kobourov
  • Giuseppe Liotta
چکیده

The ply number of a drawing is a new criterion of interest for graph drawing. Informally, the ply number of a straight-line drawing of a graph is defined as the maximum number of overlapping disks, where each disk is associated with a vertex and has a radius that is half the length of the longest edge incident to that vertex. This paper reports the results of an extensive experimental study that attempts to estimate correlations between ply numbers and other aesthetic quality metrics for a graph layout, such as stress, edge-length uniformity, and edge crossings. We also investigate the performances of several graph drawing algorithms in terms of ply number, and provides new insights on the theoretical gap between lower and upper bounds on the ply number of k-ary trees.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Vertex- and Empty-Ply Proximity Drawings

We initiate the study of the vertex-ply of straight-line drawings, as a relaxation of the recently introduced ply number. Consider the disks centered at each vertex with radius equal to half the length of the longest edge incident to the vertex. The vertex-ply of a drawing is determined by the vertex covered by the maximum number of disks. The main motivation for considering this relaxation is ...

متن کامل

An Interactive Tool to Explore and Improve the Ply Number of Drawings

Given a straight-line drawing Γ of a graph G = (V,E), for every vertex v the ply disk Dv is defined as a disk centered at v where the radius of the disk is half the length of the longest edge incident to v. The ply number of a given drawing is defined as the maximum number of overlapping disks at some point in IR. Here we present a tool to explore and evaluate the ply number for graphs with ins...

متن کامل

Low Ply Drawings of Trees

We consider the recently introduced model of low ply graph drawing, a straight-line drawing in which the ply-disks of the vertices do not have many common overlaps, which results in a good distribution of the vertices in the plane. The ply-disk of a vertex is the disk centered at it whose radius is half the length of its longest incident edge. We focus our attention on low-ply drawings of trees...

متن کامل

Investigation and Evaluation of Rolling Resistance Prediction Models for Pneumatic Tires of Agricultural Vehicles

Wheel numeric and different versions of mobility numbers are important models for predicting the rolling resistance. In this study, data related to the rolling resistance of cross ply and radial ply tires were compared with the resultant values from several models. Also, the preciseness of models in rolling resistance prediction was evaluated. For this purpose F test and 1-1 line method (p≥ 0.0...

متن کامل

A Note on Minimum-Segment Drawings of Planar Graphs

A straight-line drawing of a planar graph G is a planar drawing of G, where each vertex is mapped to a point on the Euclidean plane and each edge is drawn as a straight line segment. A segment in a straight-line drawing is a maximal set of edges that form a straight line segment. A minimum-segment drawing of G is a straightline drawing of G, where the number of segments is the minimum among all...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2017